An Online Genetic Algorithm for Automated Disassembly Sequence Generation

نویسنده

  • A. ElSayed
چکیده

In this study, we propose an intelligent automated disassembly cell for online (real time) selective disassembly. The cell is composed of an industrial robotic manipulator, a camera, range-sensing and component segmentation visual algorithms. The cell prototype allows for robotic sensory-driven disassembly under uncertainty. An online genetic algorithm model for selective disassembly is also proposed for optimal and near/optimal disassembly sequencing. INTRODUCTION Advanced technology products are regularly rendered technically obsolete within a few years of commercialization due to the rapid pace of technological developments. Thus, electronic products are frequently discarded before their materials degrade. These complex End-of-Life (EOL) products contain a broad spectrum of materials including precious metals such as silver, and valuable materials such as copper. Therefore, efficient recovery of materials in the electronic EOL products is essential for economic reasons. Furthermore, the conceptual lifetime of an electronic product depends primarily on the pace of superseding technological change that makes obsolete the otherwise fully-functioning product. Hence, the discarded product is likely to contain one or more usable components. The economically and environmentally sustainable option is to reuse these components in technically valid products. EOL processing options, e.g., reuse, recycle, and remanufacturing, are effective ways to regain the materials and the components in electronic EOL products. Regardless of the motivation, most EOL processing options necessitate a certain level of disassembly. Disassembly operations are very complex, time-consuming, and expensive. Therefore, limiting the disassembly operations to recyclable materials and reusable components in the EOL product is crucial in order to render electronic waste recovery operations economically viable. Responding to this need, generating disassembly algorithms for selective disassembly [1-2] is the first major research topic presented in this paper. Electronic waste recovery, EOL processing options, and disassembly of electronic products are well documented [316]. However, related literature falls short in providing realistic methods for product recovery. Despite the ever growing research on disassembly of electronic products, the proposed methods generally assume that the part locations are known in the product structure. Furthermore, the majority of these algorithms function under the assumption of a known hierarchical disassembly path, i.e., for a personal computer (PC) disassembly, the front or side cover must be removed to Proceedings of the ASME 2011 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robotic-Driven Disassembly Sequence Generator for End-Of-Life Electronic Products

In this study, we propose an intelligent automated disassembly cell for online (real time) selective disassembly. The cell is composed of an industrial robotic manipulator, a camera, range sensing and component segmentation visual algorithms. The cell prototype allows for robotic sensory-driven disassembly under uncertainty. An online genetic algorithm model for selective disassembly is also pr...

متن کامل

Online Torque Ripple Reduction in a Three-Phase 12 by 8 Switched Reluctance Motor Using Genetic Algorithm in PWM Generation

Despite a large number of advantages, Torque Ripple (TR) is the most important drawback of Switched Reluctance Motor (SRM). In the presented study, TR was reduced by optimizing the gate pulse angle of the SRM phase which played a leading role in the generated torque profile. For the Optimization, one of the strategies of Genetic Algorithm (GA) which was named Non-dominated Sorting Genetic Algor...

متن کامل

An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...

متن کامل

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

متن کامل

A balancing method and genetic algorithm for disassembly line balancing

Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassembly of returned products. It is therefore important that the disassembly line be designed and balanced so that it works as efficiently as possible. The disassembly line balancing problem seeks a sequence which: is feasi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011